Derivation and inference of higher-order strictness types
نویسندگان
چکیده
منابع مشابه
Derivation and inference of higher-order strictness types
We extend an existing first-order typing system for strictness analysis to the fully higher-order case, covering both the derivation system and the inference algorithm. The resulting strictness typing system has expressive capabilities far beyond that of traditional strictness analysis systems. This extension is developed with the explicit aim of formally proving soundness of higher-order stric...
متن کاملPartial Type Inference with Higher-Order Types
The language MLF is an extension of System F that permits robust first-order partial type inference with second-order polymorphism. We propose an extension of MLF’s graphical presentation with higherorder types and reduction at the type level as in System Fω. As inference of higher-order types won’t be possible in general, the extension introduces System F-style explicit type abstraction and ty...
متن کاملStrictness Types: An Inference Algorithm and an Application
This report deals with strictness types, a way of recording whether a function needs its argument(s) or not. We shall present an inference system for assigning strictness types to expressions and subsequently we transform this system into an algorithm capable of annotating expressions with strictness types. We give an example of a transformation which can be optimized by means of these annotati...
متن کاملEfficient computation of strictness types∗
Amtoft has formulated an “on-line” constraint normalization method for solving a strictness inference problem inspired by Wright. From the syntactic form of the normalized constraints he establishes that every program expression has a unique, most precise (“minimal”) strictness judgement, given fixed values for the strictness annotation in negative position. We show that his on-line normalizati...
متن کاملInference of polymorphic and conditional strictness propertiesThomas
We deene an inference system for modular strictness analysis of functional programs by extending a conjunctive strictness logic with polymorphic and conditional properties. This extended set of properties is used to deene a syntax-directed, polymorphic strictness analysis based on polymorphic recur-sion whose soundness is established via a translation from the polymorphic system into the conjun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Languages, Systems & Structures
سال: 2015
ISSN: 1477-8424
DOI: 10.1016/j.cl.2015.07.004